An Investigation of Membership and Clique Avoidance in TTP/C
نویسندگان
چکیده
Avoiding the partitioning of a cluster into cliques that are not able to communicate with each other is an important issue in the time-triggered communication protocol TTP/C. This is achieved by a mechanism called Clique Avoidance. The Clique Avoidance algorithm always selects one partition (clique) to win and causes all nodes of other partitions to shut down. In this paper, we are going to investigate the properties of this algorithm by analyzing its performance, elaborating the properties, and showing how the Clique Avoidance algorithm interacts with the Implicit Acknowledgement algorithm of TTP/C.
منابع مشابه
Parametric Verification of a Group Membership Algorithm
We address the problem of verifying clique avoidance in the TTP protocol. TTP allows several stations embedded in a car to communicate. It has many mechanisms to ensure robustness to faults. In particular, it has an algorithm that allows a station to recognize itself as faulty and leave the communication. This algorithm must satisfy the crucial ’non-clique’ property: it is impossible to have tw...
متن کاملProving "no Cliques" in a Protocol
The actual trend in the transport industry is to have electronic systems without mechanical back-up, so-called ”bywire” systems. Micro-computers control steering, brakes, power train etc... Robust protocols are needed to make these micro-computers communicate. They should be faulttolerant and yet not let the micro-computers split into disjoint communicating subsets. TTP is a time-triggered prot...
متن کاملPrototype Implementation and Evaluation of Ttp/c Prototype Implementation and Evaluation of Ttp/c Prototyp-implementierung Und Evaluierung Von Ttp/c
The prerequisite for the correct and predictable behavior of a fault tolerant distributed real time system is a communication subsystem that ful ls the strin gent requirements of distributed real time applications This includes not only a reliable message transmission with predictable and small upper bounds but also the supply of additional protocol services such as the provision of a global ti...
متن کاملIntersection graphs associated with semigroup acts
The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...
متن کاملCohen-Macaulay $r$-partite graphs with minimal clique cover
In this paper, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$, then such a cover is unique.
متن کامل